Distributions on Minimalist Grammar Derivations
نویسندگان
چکیده
We present three ways of inducing probability distributions on derivation trees produced by Minimalist Grammars, and give their maximum likelihood estimators. We argue that a parameterization based on locally normalized log-linear models balances competing requirements for modeling expressiveness and computational tractability.
منابع مشابه
Minimalist Grammar Transition-Based Parsing
Current chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the space of possible derivations by means of beam search, and does so very efficiently: the worst case complexity of building one derivation is O(n) and...
متن کاملAn Automata-Theoretic Approach to Minimalism
Vijay-Shanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially context-free structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear context-free rewriting systems (LCFRS’s, see also Weir (1988)) as a unifying framework for superficially different such formalisms (like (...
متن کاملCovert Movement in Logical Grammar
From the mid-1970s until the emergence of Chomsky’s Minimalist Program (MP, Chomsky 1995) in the 1990s, the mainstream of research on natural-language syntax in much of the world embraced a theoretical architecture for syntactic derivations that came to be known as the T-model. According to this model, which underlay Chomsky’s (1976, 1977) Extended Standard Theory (EST) of the 1970s and its suc...
متن کاملRecognizing Head Movement
Previous studies have provided logical representations and eÆcient recognition algorithms for a simple kind of \minimalist grammars." This paper extends these grammars with head movement (\incorporation") and aÆx hopping. The recognition algorithms are elaborated for these grammars, and logical perspectives are brie y considered. Michaelis (1998) showed how the derivations of a simple kind of m...
متن کاملTwo Models of Minimalist, Incremental Syntactic Analysis
Minimalist grammars (MGs) and multiple context-free grammars (MCFGs) are weakly equivalent in the sense that they define the same languages, a large mildly context-sensitive class that properly includes context-free languages. But in addition, for each MG, there is an MCFG which is strongly equivalent in the sense that it defines the same language with isomorphic derivations. However, the struc...
متن کامل